CLF: A Dependent Logical Framework for Concurrent Computations∗

We present CLF, a dependently typed logical framework with several novel features supporting concurrent computations, in particular monads and synchronous linear connectives. We illustrate its representation methodology of concurrent computations as monadic expressions via the encoding of an asynchronous π-calculus with correspondence assertions, including its dynamic semantics, safety criterion, and a type system with latent effects due to Gordon and Jeffrey. We also explain a new, general methodology for defining dependently-typed logical frameworks in the LF family. The methodology involves defining the terms of the framework directly in canonical form and greatly simplifies much of the metatheory of these frameworks, which has been notoriously difficult in the past. We have used the methodology to show that CLF has a number of key properties including decidability of type checking.